An extended type system with lambda-typed lambda-expressions
نویسنده
چکیده
We present the system d, an extended type system with lambda-typed lambdaexpressions. It is related to type systems originating from the Automath project. d extends existing lambda-typed systems by an existential abstraction operator as well as propositional operators. β-reduction is extended to also normalize negated expressions using a subset of the laws of classical negation, hence d is normalizing both proofs and formulas which are handled uniformly as functional expressions. d is using a reflexive typing axiom for a constant τ to which no function can be typed. Some properties are shown including confluence, subject reduction, uniqueness of types, strong normalization, and consistency. We illustrate how, when using d, due to its limited logical strength, additional axioms must be added both for negation and for the mathematical structures whose deductions are to be formalized.
منابع مشابه
An extended type system with lambda-typed lambda-expressions (extended version)
We present the type system d, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. d extends existing lambda-typed systems by an existential abstraction operator as well as propositional operators. β-reduction is extended to also normalize negated expressions using a subset of the laws of classical negation, hence d i...
متن کاملContextual Equivalence in Lambda-Calculi extended with letrec and with a Parametric Polymorphic Type System
This paper describes a method to treat contextual equivalence in polymorphically typed lambda-calculi, and also how to transfer equivalences from the untyped versions of lambda-calculi to their typed variant, where our specific calculus has letrec, recursive types and is nondeterministic. An addition of a type label to every subexpression is all that is needed, together with some natural constr...
متن کاملRuntime Checks as Nominal Types
We propose a language design where types can be enriched by tags corresponding to predicates written by the programmer. For instance, int&positive is a type, where positive is a user-defined boolean function on integers. Expressions of type int&positive are obtained by an explicit check construct, analogous to cast, e.g., (positive) 2. In this way, the fact that the value of an expression is gu...
متن کاملInhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search
A new, comprehensive approach to inhabitation problems in simply-typed lambda-calculus is shown, dealing with both decision and counting problems. This approach works by exploiting a representation of the search space generated by a given inhabitation problem, which is in terms of a lambda-calculus for proof search that the authors developed recently. The representation may be seen as extending...
متن کاملA Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which includes linear terms. We show that corresponding variant of the dual interpolation problem i.e. problem in which all expressions can be restricted to terms of this kind. Thus the model for this kind of expressions can a...
متن کامل